increment approxim matrix factor speed support vector machin gang wu edward chang yen kuang chen christop hugh tradit decomposit base solut support vector machin svm suffer wide scalabl problem million train set take dai svmlight run pentium sever byte memori paper propos increment algorithm perform approxim matrix factor oper speed svm approxim factor scheme kroneck incomplet choleski util primal dual interior point method ipm directli solv quadrat optim problem svm found coars approxim algorithm enjoi good speedup perform suffer poor train accuraci convers fine grain approxim algorithm enjoi good train qualiti suffer long train time subsequ propos increment train algorithm approxim ipm solut coars factor initi ipm fine grain factor extens empir studi show propos increment algorithm approxim factor substanti speed svm train maintain high train accuraci addit show propos algorithm highli paralleliz intel dual coreprocessor 